An Infinite Family of Adsorption Models and Restricted Lukasiewicz Paths
نویسندگان
چکیده
منابع مشابه
An Infinite Family of Adsorption Models and Restricted Lukasiewicz Paths
We define (k, )-restricted Lukasiewicz paths, k ≤ ∈ N0, and use these paths as models of polymer adsorption. We write down a polynomial expression satisfied by the generating function for arbitrary values of (k, ). The resulting polynomial is of degree +1 and hence cannot be solved explicitly for sufficiently large . We provide two different approaches to obtain the phase diagram. In addition t...
متن کاملinfinite dimensional garch models
مدلهای گارچ در فضاهای هیلبرت پایان نامه حاضر شامل دو بخش می باشد. در قسمت اول مدلهای اتورگرسیو تعمیم یافته مشروط به ناهمگنی واریانس در فضاهای هیلبرت را معرفی، مفاهیم ریاضی مورد نیاز در تحلیل این مدلها در دامنه زمان را مطرح کرده و آنها را مورد بررسی قرار می دهیم. بر اساس پیشرفتهایی که اخیرا در زمینه تئوری داده های تابعی و آماره های عملگری ایجاد شده است، فرآیندهایی که دارای مقادیر در فضاهای ...
15 صفحه اولan infinite planar array of rectangular microstrip patch antenna analysis
the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...
15 صفحه اولAn Infinite Restricted Boltzmann Machine
We present a mathematical construction for the restricted Boltzmann machine (RBM) that does not require specifying the number of hidden units. In fact, the hidden layer size is adaptive and can grow during training. This is obtained by first extending the RBM to be sensitive to the ordering of its hidden units. Then, with a carefully chosen definition of the energy function, we show that the li...
متن کاملFinite Satisfiability in Infinite-Valued Lukasiewicz Logic
Although it is well-known that every satisfiable formula in Lukasiewicz’ infinite-valued logic L∞ can be satisfied in some finitevalued logic, practical methods for finding an appropriate number of truth degrees do currently not exist. As a first step towards efficient reasoning in L∞, we propose a method to find a tight upper bound on this number which, in practice, often significantly improve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2011
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-011-0306-8